Processing Power to Chess Rating Ratio

50 here is what the Deep Thought team wrote about the relationship between search depth and chess strength in a 1989 article: The ascent of the brute-force chess machines back in the late 1970s made one thing crystal clear: there is a strong causal relationship between the search speed of a chess machine and its playing strength. In fact, it appeared from machine self-test games that every time a machine searches one extra ply, its rating increases by about 200-250 rating points. Since each...

 New Kind of Memory for AI

AI researchers have typically tried to get around the issues posed by by Montezuma’s Revenge and Pitfall! by instructing reinforcement-learning algorithms to explore randomly at times, while adding rewards for exploration—what’s known as “intrinsic motivation.” But the Uber researchers believe this fails to capture an important aspect of human curiosity. “We hypothesize that a major weakness of current intrinsic motivation algorithms is detachment,” they write. “Wherein the a...